Papers with downstream benchmarks

8 papers
MiLe Loss: a New Loss for Mitigating the Bias of Learning Difficulties in Generative Language Models (2024.findings-naacl)

Copied to clipboard

Challenge: Existing generative language models neglect an inherent challenge in text corpus during training, i.e., the imbalance between frequent tokens and infrequent ones.
Approach: They propose a function to mitigate the imbalance between frequent and infrequent tokens . authors propose 'MiLe Loss' function to assess learning difficulty of tokens during training .
Outcome: Experiments show that models with proposed model can improve on downstream benchmarks.
Effective Long-Context Scaling of Foundation Models (2024.naacl-long)

Copied to clipboard

Challenge: Large language models (LLMs) are rapidly deployed and continue to evolve through scaling.
Approach: They propose a method to train strong long-context LLMs that are capable of utilizing massive context windows of up to 32,000 tokens.
Outcome: The proposed model can surpass gpt-3.5-turbo-16k's overall performance on long-context benchmarks with a cost-effective instruction tuning procedure that is free of expensive annotations.
Black-Box Tuning of Vision-Language Models with Effective Gradient Approximation (2023.findings-emnlp)

Copied to clipboard

Challenge: Large vision-language models are often not open-source due to preventing abuse or commercial factors.
Approach: They propose a method for parameter-efficient fine-tuning to improve model accessibility . large models are often not open-source due to preventing abuse or commercial factors . they propose implementing a lightweight adapter over the output feature of an inaccessible model .
Outcome: The proposed methods improve on 11 benchmarks and are made publicly available.
GRASPrune: Global Gating for Budgeted Structured Pruning of Large Language Models (2026.acl-long)

Copied to clipboard

Challenge: Large language models are expensive to serve because dense FFN blocks, multi-head attention, and KV caches dominate memory.
Approach: They propose a global budgeted structured pruning framework that prunes FFN channels and attention KV head groups under a single global parameter budget.
Outcome: The proposed model removes 50% of parameters and achieves 12.18 perplexity on WikiText-2 while maintaining competitive average zero-shot accuracy on five downstream benchmarks.
ViFT: Towards Visual Instruction-Free Fine-tuning for Large Vision-Language Models (2025.findings-emnlp)

Copied to clipboard

Challenge: Visual instruction tuning is the predominant technology in eliciting multimodal task-solving capabilities of large vision-language models.
Approach: They propose a visual instruction-free fine-tuning framework for large vision-language models . they require only text-only instructions and image caption data during training .
Outcome: The proposed framework is based on visual instruction tuning, but requires images as input . it can achieve state-of-the-art performance on several downstream benchmarks with less training data.
Pruning Large Language Models to Intra-module Low-rank Architecture with Transitional Activations (2024.findings-acl)

Copied to clipboard

Challenge: Structured pruning is a feasible solution for end-side LLM deployment . however, achieving a high compression ratio for scaled-up LLMs remains a challenge .
Approach: They propose a task-agnostic structured pruning approach coupled with a compact Transformer architecture to prune LLMs into an intra-module low-rank architecture.
Outcome: The proposed approach reduces transitional activations inside multi-head attention (MHA) and multi-layer perceptron (MLP) modules while preserving inter-module activations sensitive to perturbations.
HFT: Half Fine-Tuning for Large Language Models (2025.acl-long)

Copied to clipboard

Challenge: Large language models (LLMs) with one or more fine-tuning phases can unlock various capabilities, but can be catastrophic forgetting during sequential training.
Approach: They propose a method to regularly reset partial parameters to mitigate forgetting issues by using half fine-tuning instead of full fine-uning.
Outcome: The proposed approach reduces the risk of catastrophic forgetting during training and the parametric knowledge lost during training may be overwhelmed by incoming training data.
Unveiling the Flaws: Exploring Imperfections in Synthetic Data and Mitigation Strategies for Large Language Models (2024.findings-emnlp)

Copied to clipboard

Challenge: acquiring large amounts of high-quality data can be challenging due to data scarcity, privacy concerns, and high costs.
Approach: They propose a method which reverses instruction-following issues caused by uniform format of synthetic data and proposes unlearning techniques to mitigate these flaws.
Outcome: The proposed method reverses instruction-following issues caused by pattern overfitting without compromising performance on benchmarks at relatively low cost.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations